A Method for Rapid Prototyping and Benchmarking of Arrival Sequencing and Scheduling Algorithms
نویسندگان
چکیده
A method is introduced for rapid prototyping and benchmarking of arrival sequencing and scheduling algorithms for air traffic management. The method has three main components: 1) algorithm models 2) recorded air traffic simulation data, and 3) a free software library that interfaces the algorithm models with the simulation output database. By accessing simulation data via a relational database, the method makes it possible to quickly implement prototype algorithms and then to evaluate them without a direct interface to the airspace simulator code. To illustrate this method, a basic first-come, firstserved arrival sequencing and scheduling algorithm was studied. Results are offered as benchmarks for comparison with future arrival sequencing and scheduling algorithms.
منابع مشابه
Benchmarking Code Generation Methodologies for Programmable Digital Signal Processors
We evaluate rapid prototyping tools and compilers as code generation methodologies for programmable digital signal processors (DSPs). Code generated by compilers and rapid prototyping tools have been reported as significantly less efficient in memory usage and execution time versus assembly language code written by expert programmers. As the complexity of the system increases, however, the scal...
متن کاملApplication of the Extreme Learning Machine for Modeling the Bead Geometry in Gas Metal Arc Welding Process
Rapid prototyping (RP) methods are used for production easily and quickly of a scale model of a physical part or assembly. Gas metal arc welding (GMAW) is a widespread process used for rapid prototyping of metallic parts. In this process, in order to obtain a desired welding geometry, it is very important to predict the weld bead geometry based on the input process parameters, which are voltage...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملA Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
متن کاملRapid Prototyping with Reconfigurable Hardware for Embedded Hard Real-Time Systems
∗ This work is supported with funds of the Deutsche Forschungsgemeinschaft within the priority program "Rapid Prototyping for Integrated Control Systems with Hard RealTime Constraints" Abstract: This paper describes a rapid prototyping system for the design and development of hard real time systems. The main focus of this rapid prototyping system is on scheduling algorithms. Issues of their imp...
متن کامل